Activation strategy for relaxed asymmetric coloring games
نویسندگان
چکیده
منابع مشابه
Activation strategy for asymmetric marking games
This paper extends the widely used activation strategy of the marking game on graphs to asymmetric marking games. The extended activation strategy is then applied to asymmetric marking games on chordal graphs, (s, t)-pseudo partial k-trees and interval graphs. Our results improve earlier upper bounds on (a, 1)gcol (Ik) and (a, 1)-gcol (Ck), where Ik and Ck denote the classes of interval and cho...
متن کاملAsymmetric graph coloring games
We introduce the (a; b)-coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors a vertices and Bob colors b vertices. We also introduce a related game, the (a; b)-marking game. We analyze these games and determine the (a; b)chromatic numbers and (a;b)-coloring num...
متن کاملAsymmetric directed graph coloring games
This note generalizes the (a, b)-coloring game and the (a, b)-marking game which were introduced by Kierstead [7] for undirected graphs to directed graphs. We prove that the (a, b)-chromatic and (a, b)-coloring number for the class of orientations of forests is b + 2 if b ≤ a, and infinity otherwise. From these results we deduce upper bounds for the (a, b)-coloring number of oriented outerplana...
متن کاملAsymmetric Coloring Games on Incomparability Graphs
Consider the following game on a graph G: Alice and Bob take turns coloring the vertices of G properly from a fixed set of colors; Alice wins when the entire graph has been colored, while Bob wins when some uncolored vertices have been left. The game chromatic number of G is the minimum number of colors that allows Alice to win the game. The game Grundy number of G is defined similarly except t...
متن کاملClique-Relaxed Competitive Graph Coloring
In this paper we investigate a variation of the graph coloring game, as studied in [2]. In the original coloring game, two players, Alice and Bob, alternate coloring vertices on a graph with legal colors from a fixed color set, where a color α is legal for a vertex if said vertex has no neighbors colored α. Other variations of the game change this definition of a legal color. For a fixed color ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.09.047